Managing Complexity by Recursion

نویسنده

  • Bernd Schiemenz
چکیده

Recursion is a well known concept within computer science and mathematics . In business management it is rarely used explicitly. Counterexamples are applications of dynamic programming and the ́Viable System ́ of Stafford Beer [Beer, 1972]. This paper demonstrates the broad applicability of recursion to managing complexity, especially in business. It starts by showing that recursion is – in contrast to how it may appear in papers of e.g. H.A.Simon [Simon, 1973] – a special case of (intra-systems-)hierarchy. It shows the two different yet related forms of using recursion: recursive objects and recursive problem solving and gives general examples of both. It then focuses on recursive objects and problem solving in business and finally summarizes the advantages of recursion.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A recursive approach to software development

Researchers and practitioners alike agree that the waterfall approach to software development results in poor quality software systems. Unfortunately, the waterfall approach is inherently used in almost all of today’s development efforts resulting in system failures. The problem lies in the forward, linear development effort that produces inconsistent and incorrect specifications, designs, and ...

متن کامل

Recursion Schemata for NCk

We give a recursion-theoretic characterization of the complexity classes NC for k ≥ 1. In the spirit of implicit computational complexity, it uses no explicit bounds in the recursion and also no separation of variables is needed. It is based on three recursion schemes, one corresponds to time (time iteration), one to space allocation (explicit structural recursion) and one to internal computati...

متن کامل

Linear Ramified Higher Type Recursion and Parallel Complexity

A typed lambda calculus with recursion in all finite types is defined such that the first order terms exactly characterize the parallel complexity class NC. This is achieved by use of the appropriate forms of recursion (concatenation recursion and logarithmic recursion), a ramified type structure and imposing of a linearity constraint.

متن کامل

Recursion schemata for NC

We give a recursion-theoretic characterization of the complexity classes NC for k ≥ 1. In the spirit of implicit computational complexity, it uses no explicit bounds in the recursion and also no separation of variables is needed. It is based on three recursion schemes, one corresponds to time (time iteration), one to space allocation (explicit structural recursion) and one to internal computati...

متن کامل

Tailoring Recursion for Complexity

We design functional algebras that characterize various complexity classes of global functions. For this purpose, classical schemata from recursion theory are tailored for capturing complexity. In particular we present a functional analogue of rst-order logic and describe algebras of the functions computable in nondeterministic logarithmic space, deterministic and nondeterministic polynomial ti...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2002